#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<list>
#include<cstdlib>
#include<cmath>
#include<sstream>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<stack>
#define PI acos(-1)
#define MP make_pair
#define PB push_back
#define VI vector <int>
#define PII pair <int,int>
#define LL long long
#define SET(v,i) memset(v, i, sizeof(v))
#define FOR(i,a,b) for (int i = (a); i <= (b); i++)
#define FORD(i,a,b) for (int i = (a); i >= (b); i--)
#define FORN(i,a,b) for (int i = (a); i < (b); i++)
#define DOWN(i,a,b) for (int i = (a); i > (b); i--)
#define FIT(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); it++)
#define FITD(it,v) for (typeof(v.rbegin()) it = v.rbegin(); it != v.rend(); it++)
using namespace std;
const int N=101,mod=1000000007;
LL c[N][N],dp[N][N*N];
LL fen(LL a,LL k,int mod){
   LL t=1,p=a%mod;
   while(k){
         if(k&1)t=t*p%mod;
         p=p*p%mod;k>>=1;   
         }       
   return t;      
   }
int main(){
	c[0][0]=1;
	for(int i=1;i<N;i++){
		c[i][0]=1;
		for(int j=1;j<=i;j++){
			c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
			}
		}
	
	int n,K;
	LL m;
	cin>>n>>m>>K;
	memset(dp,0,sizeof(dp));
	
	dp[0][0]=1;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=n&&j<=K;j++){
			LL t=fen(c[n][j],(m-i)/n+1,mod);
			for(int k=0;k+j<=K&&k<=(i-1)*n;k++){
				dp[i][j+k]+=dp[i-1][k]*t%mod;
				dp[i][j+k]%=mod;
				}
			}
		}
	cout<<dp[n][K]<<endl;
    return 0;
    }
